Approximation of subadditive functions and convergence rates in limiting-shape results

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Growth Rates of Subadditive Functions for Semiflows

Let ,: X_T+ X be a semiflow on a compact metric space X. A function F: X_T+ X is subadditive with respect to , if F(x, t+s) F(x, t)+F(,(x, t), s). We define the maximal growth rate of F to be supx # X lim supt (1 t) F(x, t). This growth rate is shown to equal the maximal growth rate of the subadditive function restricted to the minimal center of attraction of the semiflow. Applications to Birkh...

متن کامل

a contrastive study of rhetorical functions of citation in iranian and international elt scopus journals

writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...

Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + , 1)-reduction of the facility location problem with subadditive costs to a soft capacitated facility location problem, which i...

متن کامل

Distributed Statistical Estimation and Rates of Convergence in Normal Approximation

This paper presents new algorithms for distributed statistical estimation that can take advantage of the divide-and-conquer approach. We show that one of the key benefits attained by an appropriate divide-and-conquer strategy is robustness, an important characteristic of large distributed systems. We introduce a class of algorithms that are based on the properties of the geometric median, estab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1997

ISSN: 0091-1798

DOI: 10.1214/aop/1024404277